THE HECKE ALGEBRA $H(PQ,PZ)$ ARISING IN NUMBER THEORY
نویسندگان
چکیده
منابع مشابه
Representation Theory of the Nonstandard Hecke Algebra
The nonstandard Hecke algebra Ȟr was defined in [11] to study the Kronecker problem. We study a quotient Ȟr,2 of Ȟr , called the nonstandard Temperley-Lieb algebra, which is simpler than Ȟr. It is defined to be the subalgebra of Hr,2⊗Hr,2 generated by Pi := C ′ i ⊗C ′ i +Ci ⊗Ci, i ∈ [r− 1], where Hr,2 is the Temperley-Lieb algebra and C i and Ci are Kazhdan-Lusztig basis elements. We give a com...
متن کاملNemo/Hecke: Computer Algebra and Number Theory Packages for the Julia Programming Language
We introduce two new packages, Nemo and Hecke, written in the Julia programming language for computer algebra and number theory. We demonstrate that high performance generic algorithms can be implemented in Julia, without the need to resort to a lowlevel C implementation. For specialised algorithms, we use Julia’s efficient native C interface to wrap existing C/C++ libraries such as Flint, Arb,...
متن کاملThe affine Hecke algebra
1 The affine Hecke algebra 1.1 The alcove walk algebra Fix notations for the Weyl group W , the extended affine Weyl group W , and their action on Ω × h * R as in Section 2. Label the walls of the alcoves so that the fundamental alcove has walls labeled 0, 1,. .. , n and the labeling is W-equivariant (see the picture in (2.12)). The periodic orientation is the orientation of the walls of the al...
متن کاملHecke Algebra Actions on the Coinvariant Algebra
Two actions of the Hecke algebra of type A on the corresponding polynomial ring are introduced. Both are deformations of the natural action of the symmetric group on polynomials, and keep symmetric functions invariant. An explicit combinatorial formula is given for the resulting graded characters on the coinvariant algebra.
متن کاملComputational Number Theory and Algebra
Proof (Continued from the previous class) We have already shown in the previous class that the algorithm halts after polynomially many executions of the while-loop as the index i can decrease for at most O(n logA) times in step 6. In order to complete the proof, we also need to show that the size of the numerator and denominator of any rational number involved in the computation is polynomially...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Pure and Apllied Mathematics
سال: 2016
ISSN: 1311-8080,1314-3395
DOI: 10.12732/ijpam.v107i3.20